Low Carbon Scheduling with Iterative Ant Colony Algorithm
نویسندگان
چکیده
منابع مشابه
Ant Colony Algorithm for Surgery Scheduling Problem
Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...
متن کاملA Hybrid Ant Colony Optimization Algorithm for Software Project Scheduling
The extraction of comprehensible knowledge is one of the major challenges in many domains. In this concept, an ant programming (AP) framework, which is capable of mining classification rules easily comprehensible by humans, and, therefore, capable of supporting expert-domain decisions, is presented. The algorithm proposed, called grammar based ant programming (GBAP), is the first AP algorithm d...
متن کاملSimulated Annealing-Based Ant Colony Algorithm for Tugboat Scheduling Optimization
As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation mo...
متن کاملA Disk Scheduling Algorithm Based on ANT Colony Optimization
Audio, animations and video belong to a class of data known as delay sensitive because they are sensitive to delays in presentation to the users. Also, because of huge data in such items, disk is an important device in managing them. In order to have an acceptable presentation, disk requests deadlines must be met, and a real-time scheduling approach should be used to guarantee the timing requir...
متن کاملCloud Task Scheduling Simulation via Improved Ant Colony Optimization Algorithm
As a distributed parallel computing, cloud computing has an absolute advantage in accessing and processing of huge amount of data. How to assign all these virtual cloud computing resources to the user is a key technical issues, scholars have proposed greedy algorithm, FCFS, and other variety of algorithms to solve this problem. However, the algorithms just build a local optimal solution, there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Smart Home
سال: 2016
ISSN: 1975-4094,1975-4094
DOI: 10.14257/ijsh.2016.10.5.03